Some Pursuit-Evasion Problems on Grids
نویسنده
چکیده
Dawes, R.W., Some pursuit-evasion problems on grids, Information Processing Letters 43 (1992) 241-247. In a rectangular grid, a pursuit-evation “game” is played according to simple rules. One player (the cop) wins if both players ever occupy either the same row or the same column of the grid. The other player (the robber) wins if the cop loses. Movement of the players is restricted to the rows and columns of the grid, and the speeds at which the players move are limited. We present a new upper bound for the minimum cop’s speed required to guarantee a win for the cop, and consider some variations on the problem.
منابع مشابه
Distributed Searching of Partial Grids
We consider the following distributed pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown n-node network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few agents as possible. We restrict our attention to networks that are embedded into partial grids:...
متن کاملESP: pursuit evasion on series-parallel graphs
We study pursuit-evasion problems where pursuers have to clear a given graph of fast-moving evaders despite poor visibility, for example, where police search a cave system to ensure that no terrorists are hiding in it. If the vertex connectivity of some part of the graph exceeds the number of pursuers, the evaders can always avoid capture. We therefore focus on graphs whose subgraphs can always...
متن کاملOn Some Pursuit and Evasion Differential Game Problems for an Infinite Number of First-Order Differential Equations
We study pursuit and evasion differential game problems described by infinite number of firstorder differential equations with function coefficients in Hilbert space l2. Problems involving integral, geometric, and mix constraints to the control functions of the players are considered. In each case, we give sufficient conditions for completion of pursuit and for which evasion is possible. Conseq...
متن کاملSearch problems on 1-skeletons of regular polyhedrons
For pursuit-evasion games played on 1-skeletons of regular polyhedrons some problems of finding the minimum number of pursuers needed for the capture (in various senses) of the mobile invisible evader are considered. The results obtained for these graphs are consequences of fundamental theorems in the theory of graph searching developed by authors in [1, 2, 3].
متن کاملThe Role of Visibility in the Cops-Robber Game and Robotic Pursuit / Evasion
The cops-and-robber (CR) game has been used in mobile robotics as a discretized model of pursuit/evasion problems. The “classical” CR version is a perfect information game: the cop’s (pursuer’s) location is always known to the robber (evader) and vice versa. More relevant to robotics are versions where one (or both) player is invisible. In this paper we study the extent to which the CR game bec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 43 شماره
صفحات -
تاریخ انتشار 1992